Batch Markovian Arrival Processes (BMAP)
نویسندگان
چکیده
This article describes the batch Markovian arrival process (BMAP), a point process that is characterized by Markov-modulated batch arrivals of random size. The BMAP is a generalization of many well-known processes including the Markovian arrival process (MAP), the Poisson process, and the Markov-modulated Poisson process. It provides a common framework for modeling arrival processes in a variety of applications. We formally define the continuousand discrete-time BMAP, review a few basic results for each, and show how these processes generalize many common point processes. Additionally, we provide suggestions for further reading on the subject.
منابع مشابه
Using Factorization in Analyzing D-bmap/g/1 Queues
The discrete-time batch Markovian arrival process (D-BMAP) was first defined in [2]. The D-BMAP can represent a variety of arrival processes which include, as special cases, the Bernoulli arrival process, the Markov-modulated Bernoulli process (MMBP), the discrete-time Markovian arrival process (D-MAP), and their superpositions. It is the discrete-time version of the versatile Markovian point p...
متن کاملFurther Transient Analysis of the BMAP/G/1 Queue
Previously, we derived the two-dimensional transforms of the emptiness function, the transient workload and queue-length distributions in the single-server queue with general service times and a batch Markovian arrival process (BMAP). This arrival process includes the familiar phase-type renewal process and the Markov modulated Poisson process as special cases, as well as superpositions of thes...
متن کاملTraffic Modeling of IP Networks Using the Batch Markovian Arrival Process
In this paper, we identify the batch Markovian arrival process (BMAP) as analytically tractable model of choice for aggregated traffic modeling of IP networks. The key idea of this aggregated traffic model lies in customizing the batch Markovian arrival process such that the different lengths of IP packets are represented by rewards (i.e., batch sizes of arrivals) of the BMAP. The utilization o...
متن کاملOn the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
We consider finiteand infinite-capacity queues with discrete-time batch Markovian arrival processes (D-BMAP) under the assumption of the Late Arrival System with Delayed Access as well as the Early Arrival System. Using simple arguments such as the balance equation, “rate in = rate out,” we derive relationships among the stationary queue lengths at arrival, at departure, and at random epochs. S...
متن کاملThe BMAP/G/1 queue with level dependent arrivals: An extended queueing model for stations with nonrenewal and state dependent input traffic
Parallel zu diesen Entwicklungen stiegen die Anforderungen an die Methoden zur Leistungsanalyse derartiger Systeme. Die Warteschlangentheorie stellt klassische Modelle zur Analyse von Kommunikationsnetzen bereit. Ein Bereich in der modernen Warteschlangentheorie sind die Matrix analytischen Methoden. Hier konzentriert sich die Forschung auf den Batch Markovian Arrival Process (BMAP), welcher äq...
متن کامل